A member of the herbrand base is called atom in automatic theorem proving 在自動定理證明中,海爾勃朗基的成員也稱為原子。
A new method based on numeric computation for automated geometric theorem proving and discovering is shown 摘要該文提出了利用數(shù)值方法進(jìn)行幾何定理自動搜索的方法,并基于此方法開發(fā)了幾何定理動態(tài)搜索系統(tǒng)。
Singapore : world scientific , 1994 . 4 li h , wu y . automated theorem proving in projective geometry with cayley and bracket algebras 其中特征列方法是定理機(jī)器證明與方程求解的基礎(chǔ),也是數(shù)學(xué)機(jī)械化領(lǐng)域目前研究的核心內(nèi)容。
An convergence theorem proved and in order to speed convergence of working - set algorithm , constrained matrix derived from abs in working - set method corrected 為提高算法的收斂速度,對工作集算法中由abs算法生成的約束陣進(jìn)行了校正
In this paper , we do two things . first , for theorem proving problem such like ( vx ) ( 3y ) p ( x , y ) , we present a method for extracting procedure from the proofs generated by the resolution principle ) y ) p ( x , y )的定理證明問題,本文從分析歸結(jié)證明樹中的每個節(jié)點(diǎn)入手,提取歸結(jié)證明的過程信息,生成一個程序。
In 1989 , academician wu wen - tsun forwards wu differential characteristic method which establish theoretical basis for mechanical theorem proving of differential geometry and the research of automatic reasoning 1989年吳文俊院士提出了吳?微分特征列法,為微分幾何定理的機(jī)械化證明和自動推理的理論研究奠定了理論基礎(chǔ)。
6 wu w t . basic principles of mechanical theorem proving in geometries . volume i : part of elementary geometries , beijing : science press , 1984 ; springer 1994 . 7 wu w t . mathematics mechanization 2提供了一種基于吳方法的增元消元法的求解方程組獨(dú)立個數(shù)的數(shù)學(xué)新思路,不僅可以被數(shù)學(xué)領(lǐng)域而且可以被工程領(lǐng)域里的研究人員所借鑒。
1 wu w t . on the decision problem and the mechanization of theorem - proving in elementary geometry . scientia sinica , 1978 , : 159 - 172 . re - published in em automated theorem proving : after 25 years , 1984 , pp . 213 - 234 本文第一作者于上世紀(jì)七十年代末開始從事數(shù)學(xué)機(jī)械化研究,致力于實(shí)現(xiàn)推理與方程求解的自動化,并創(chuàng)立了幾何定理機(jī)器證明的吳方法與方程求解的特征列方法。
In proposbonal calculus , the processing ofresoluhon pdriciple have combination explosion naturally so , how to eltw combinaion explosion in the processing of resolution ( genetal showed computationaily hard problem ) is an in1portan subject in automated theorem proving 命題邏輯系統(tǒng)中的歸結(jié)原理本質(zhì)上存在組合問題,因此,如何避免組合問題(通常以計(jì)算復(fù)雜性的形式出現(xiàn))是自動推理研究中的一個重要課題。
Secondly , definitions of a extended bethe tree , bethe tree and cayley tree are introduced . further , the even - odd markov chain fields and markov chain fields indexed by a extended bethe tree , bethe tree and cayley tree are defined . subsequently the strong limit theorems proved above are applied to the study of all kinds of even - odd markov chain fields and markov chain fields defined above , which both extend the conclusions in [ 30 ] and [ 39 ] and prove a class of strong limit theorems for the even - odd markov chain fields and markov chain fields . as corollaries , we obtain some strong limit theorems for the frequencies of occurrence of states and ordered couples of states for the even - odd markov chain fields and markov chain fields . lastly , some coarse estimates are gained about the state occurrence frequencies for all kinds of even - odd markov chain fields and markov chain fields defined in the paper 然后把前面所證得的一類強(qiáng)極限定理應(yīng)用到本文中所定義的各種奇偶馬爾可夫鏈場、馬爾可夫鏈場的研究工作中,從而推廣了[ 30 ]和[ 39 ]中的結(jié)論,獲得了本論文中所定義的各種奇偶馬爾可夫鏈場、馬爾可夫鏈場的一類強(qiáng)極限定理。作為這一類強(qiáng)極限定理的推論得到了狀態(tài)和狀態(tài)序偶出現(xiàn)頻率的一類強(qiáng)極限定理。最后,給出了本論文中所定義的各種奇偶馬爾可夫鏈場、馬爾可夫鏈場上狀態(tài)出現(xiàn)頻率的若干粗略估計(jì)。